Contrasting Correlations by an Efficient Double-Clique Condition

نویسندگان

  • Aixiang Li
  • Makoto Haraguchi
  • Yoshiaki Okubo
چکیده

Contrast set mining has been extensively studied to detect changes between several contrasted databases. Previous studies mainly compared the supports of an itemset and extracted the itemsets with significantly different supports across those databases. Differently, we contrast the correlations of an itemset between two contrasted databases and attempt to detect potential changes. Any highly correlated itemset is not of our concern in order to focus on implicitly emerging correlation. Therefore, we set correlation constraints (upper bounds) in both databases, and then extract the itemsets consisting of items that are not highly correlated in both databases, but exhibiting a potential change of correlations from one database to the other. We investigate both positive and negative correlations. We also investigate the correlation under conditioning by third variables. Thus, we also study so called partial correlation. To measure this kind of correlation, we use extended mutual information. In our search procedure for the correlated itemsets, we use a double-clique condition, which is necessary for itemsets to be solutions satisfying the correlation constraints. We show its usefulness through experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Overall Heat Transfer Characteristics of a Double Pipe Heat Exchanger: Comparison of Experimental Data with Predictions of Standard Correlations

The single-phase flow and thermal performance of a double pipe heat exchanger are examined by experimental methods. The working fluid is water at atmospheric pressure. Temperature measurements at the inlet and outlet of the two streams and also at an intermediate point half way between the inlet and outlet is made, using copper-constantan thermocouple wires. Mass flow rates for each stream are ...

متن کامل

Cohen-Macaulay $r$-partite graphs with minimal clique cover

‎In this paper‎, ‎we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay‎. ‎It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$‎, ‎then such a cover is unique‎.

متن کامل

An Efficient Double Skin Façade for an Office Building in Shiraz City

Energy efficiency in office buildings has been the center of attention for many researches. This special attention is due to highly energy consumption in this building type. Refinement of facade and building’s envelop is a good approach to reduce buildings energy requirements. Double skin facade concepts are commonly used to achieve that object. Although the concept is not new, there is a growi...

متن کامل

Clique Topology Reveals Intrinsic Geometric Structure in Neural Correlations: An Overview

Clique topology is a central theme in this paper and is best explained by breaking it down into two terms. A clique is a complete graph, C that is a subgraph of a directed graph G = (V,E). Alternatively, a clique in an undirected graph G is a subset of vertices, C ⊆ V where every pair of distinct vertices are adjacent. Topology in this case refers to the study of the orientation of clique conne...

متن کامل

On Efficient Domination for Some Classes of H-Free Chordal Graphs

A vertex set D in a finite undirected graph G is an efficient dominating set (e.d.s. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d.s. in G, is known to be NP-complete even for very restricted graph classes such as for 2P3-free chordal graphs while it is solvable in polynomial time for P...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Trans. MLDM

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2011